A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property
نویسنده
چکیده
Seymour proved that the set of odd circuits of a signed binary matroid (M; ) has the Max-Flow Min-Cut property if and only if it does not contain a minor isomorphic to (M(K4); E(K4)). We give a shorter proof of this result.
منابع مشابه
On Packing T-Cuts
A short proof of a difficult theorem of P.D. Seymour on grafts with the max-flow min-cut property is given.
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملA Note on Maxflow-Mincut and Homomorphic Equivalence in Matroids
Graph homomorphisms are used to study good characterizations for coloring problems (Trans. Amer. Math. Soc. 384 (1996), 1281–1297; Discrete Math. 22 (1978), 287–300). Particularly, the following concept arises in this context: A pair of graphs (A, B) is called a homomorphism duality if for any graph G either there exists a homomorphism σ : A→ G or there exists a homomorphism τ : G → B but not b...
متن کاملA Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks
Intrigued by the capacity of random networks, we start by proving a max-flow min-cut theorem that is applicable to any random graph obeying a suitably defined independence-in-cut property. We then show that this property is satisfied by relevant classes, including small world topologies, which are pervasive in both man-made and natural networks, and wireless networks of dual devices, which expl...
متن کاملFlow Networks and the Min-Cut-Max-Flow Theorem
We present a formalization of flow networks and the Min-Cut-MaxFlow theorem. Our formal proof closely follows a standard textbook proof, and is accessible even without being an expert in Isabelle/HOL— the interactive theorem prover used for the formalization.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 23 شماره
صفحات -
تاریخ انتشار 1977